Fixed Topology Skeletons
نویسندگان
چکیده
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchanged throughout the skeleton computation, which greatly reduces sensitivity of the skeleton to noise in the shape outline. Furthermore, this representation naturally defines an ordering of the points along the skeleton. The process of skeleton extraction can be formulated as energy minimization in this framework. We provide an iterative, snake-like algorithm for the skeleton estimation using distance transform. Fixed topology skeletons are useful if the global shape of the object is known ahead of time, such as for people silhouettes, hand outlines, medical structures, images of letters and digits. Small changes in the object outline should be either ignored, or detected and analyzed, but they do not change the general structure of the underlying skeleton. Example applications include tracking, object recognition and
منابع مشابه
Parallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملCritical fixed point theorems in Banach algebras under weak topology features
In this paper, we establish some new critical fixed point theorems for the sum $AB+C$ in a Banach algebra relative to the weak topology, where $frac{I-C}{A}$ allows to be noninvertible. In addition, a special class of Banach algebras will be considered.
متن کاملGeodesic grassfire for computing mixed-dimensional skeletons
Skeleton descriptors are commonly used to represent, understand and process shapes. While existing methods produce skeletons at a fixed dimension, such as surface or curve skeletons for a 3D object, often times objects are better described using skeleton geometry at a mixture of dimensions. In this paper we present a novel algorithm for computing mixed-dimensional skeletons. Our method is guide...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملIsthmus-Based 6-Directional Parallel Thinning Algorithms
Skeletons are widely used in pattern recognition and image analysis. A way to obtain skeletons is the thinning approach, consisting in iteratively removing points from the object without changing the topology. In order to preserve geometric information, it is usual to preserve curve end points (for curve skeletons) or surface end points (for surface skeletons). In this paper we propose a new fa...
متن کامل